Covert Communications With Constrained Age of Information

In this letter, we consider the requirement of information freshness in covert communications for first time. With artificial noise (AN) generated from a full-duplex (FD) receiver, formulate covertness maximization problem under average age (AoI) constraint to optimize transmit probability signal. particular, not only represents generation rate signal but also prior alternative hypothesis communications, which builds up bridge between and communication covertness. Our analysis shows that best is always 0.5, differs equal probabilities assumption most related works on communications. Furthermore, limitation AoI enlarges at cost reduction leads positive lower bound power non-zero